Fast combinatorial optimization with parallel digital computers
نویسندگان
چکیده
This paper presents an algorithm which realizes fast search for the solutions of combinatorial optimization problems with parallel digital computers.With the standard weight matrices designed for combinatorial optimization, many iterations are required before convergence to a quasioptimal solution even when many digital processors can be used in parallel. By removing the components of the eingenvectors with eminent negative eigenvalues of the weight matrix, the proposed algorithm avoids oscillation and realizes energy reduction under synchronous discrete dynamics, which enables parallel digital computers to obtain quasi-optimal solutions with much less time than the conventional algorithm.
منابع مشابه
Interactive Optimization and Massively Parallelimplementations of Video Compression
This paper presents a new technique which allows interactive optimization of video compression algorithms using massively parallel computers such as the CRAY T3D. This work aims to exploit as much as possible the parallel nature of digital image processing algorithms to obtain almost real-time computing with the exibility of a software implementation. Thanks to this low computation time, intera...
متن کاملZRAM: a library of parallel search algorithms and its use in enumeration and combinatorial optimization
ZRAM is a software library which renders the power of parallel computers usable for combinatorial optimization and enumeration. It provides a set of parallel search engines for branch-and-bound, reverse search, backtrack¬ ing and tree-size estimation. These search engines hide the complexity of parallelism from the application programmer. ZRAM contains the first parallel implementation of the r...
متن کاملOptimizing neural networks on SIMD parallel computers
Hop eld neural networks are often used to solve diÆcult combinatorial optimization problems. Multiple restarts versions nd better solutions but are slow on serial computers. Here, we study two parallel implementations on SIMD computers of multiple restarts Hop eld networks for solving the maximum clique problem. The rst one is a ne-grained implementation on the Kestrel Parallel Processor, a lin...
متن کاملBranch-and-Cut Algorithms for Combinatorial Optimization Problems
Branch-and-cut methods are very successful techniques for solving a wide variety of integer programming problems, and they can provide a guarantee of optimality. We describe how a branch-and-cut method can be tailored to a specific integer programming problem, and how families of general cutting planes can be used to solve a wide variety of problems. Other important aspects of successful implem...
متن کاملPartitioning of unstructured meshes for load balancing
Many large-scale engineering and scientiic calculations involve repeated updating of variables on an unstructured mesh. To do these types of computations on distributed memory parallel computers, it is necessary to partition the mesh among the processors so that the load balance is maximized and inter-processor communication time is minimized. This can be approximated by the problem of partitio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE transactions on neural networks
دوره 11 6 شماره
صفحات -
تاریخ انتشار 2000